Supervisors of Petri Nets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesis of supervisors enforcing general linear constraints in Petri nets

Efficient techniques exist for the design of supervisors enforcing constraints consisting of linear marking inequalities. This note shows that without losing the benefits of the prior techniques, the class of constraints can be generalized to linear constraints containing marking terms, firing vector terms, and Parikh vector terms. We show that this extended class of constraints is more express...

متن کامل

Synthesis of Supervisors Enforcing Firing Vector Constraints in Petri Nets

This paper considers the problem of enforcing linear constraints containing marking terms, firing vector terms, and Parikh vector terms. Such constraints increase the expressivity power of the linear marking constraints. We show how this new type of constraints can be enforced in Petri nets. In the case of fully controllable and observable Petri nets, we give the construction of a supervisor en...

متن کامل

Design of -Liveness Enforcing Supervisors in Petri Nets

This paper presents a procedure for the design of supervisors that enforce the transitions in a given set to be live. -liveness enforcement corresponds to full liveness enforcement when equals the total set of transitions. Rather than assuming a given initial marking, this procedure generates at every iteration a convex set of admissible initial markings. In the case of full liveness enforcemen...

متن کامل

Automated Synthesis of Deadlock Prevention Supervisors Using Petri Nets

Given an arbitrary Petri net structure, which may have uncontrollable and unobservable transitions, the deadlock prevention procedure presented here determines a set of linear inequalities on the marking of a Petri net. When the Petri net is supervised so that its markings satisfy these inequalities, the supervised net is proved to be deadlock-free for all initial markings that satisfy the supe...

متن کامل

Automated Synthesis of Liveness Enforcing Supervisors Using Petri Nets

Given an arbitrary Petri net structure, which may have uncontrollable and unobservable transitions, the liveness enforcement procedure presented here determines a set of linear inequalities on the marking of a Petri net. When the Petri net is supervised so that its markings satisfy these inequalities, the supervised net is proved to be live for all initial markings that satisfy the supervision ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Research Papers Faculty of Materials Science and Technology Slovak University of Technology

سال: 2019

ISSN: 1338-0532

DOI: 10.2478/rput-2019-0023